Memory / Time Optimization of 2

(PUBLISHED AT ICASSP'95) Nelson Luiz Passos and Edwin Hsing-Mean Sha Dept. of Computer Science & Engineering University of Notre Dame Notre Dame, IN 46556 ABSTRACT Two-dimensional lters are commonly used in digital image processing applications. These lters have the characteristic of processing recursive sets of instructions requiring high computational speed. In this paper, these sets are modeled as cyclic two-dimensional data ow graphs, which are also used to represent the equivalent circuit design. In this new method, such graphs are submitted to a multidimensional retiming in order to reduce their cycle time. Such a reduction can achieve a cycle equal to the longest atomic operation in the lter, by inserting a xed number of registers, independent of the size of the problem, into the circuit paths. Examples, description and the correctness of our algorithm are presented in the paper.